1821A - Matching - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define ft first
#define sd second
#define P pair<ll,ll>
#define TT ll tt;for(cin>>tt;tt--;)
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const ll N=2e5+5;
const ll NN=1e6+6;
const ll mod=1e9+7;
ll b[NN],a[NN],c[NN];
vector<ll>v;
unordered_map<ll,ll>mp;
string s;
ll n,m;
ll ans=0;
//x,y,z; sum,res,cur,tmp; l,r,ll,rr; p,pp;
//暴力枚举,前缀和，二分，dfs，双指针，差分，并查集,逆元

void solve()
{
	cin>>s;
	m=count(s.begin(),s.end(),'?');
	if(s[0]=='?')ans=pow(10,m-1)*9ll;
	else if(s[0]=='0') ans=0;
	else ans=pow(10,m)*1ll;
	cout<<ans<<'\n';
}
signed main()
{
	IOS;
	TT
	solve();
	return 0;
}